Free wreath product quantum groups: The monoidal category, approximation properties and free probability

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Free Wreath Product by the Quantum Permutation Group

Let A be a compact quantum group, let n ∈ N∗ and let Aaut(Xn) be the quantum permutation group on n letters. A free wreath product construction A∗wAaut(Xn) is done. This construction provides new examples of quantum groups, and is useful to describe the quantum automorphism group of the n-times disjoint union of a finite connected graph.

متن کامل

Free Product Formulae for Quantum Permutation Groups

Associated to a finite graph X is its quantum automorphism group G(X). We prove a formula of type G(X ∗ Y ) = G(X) ∗w G(Y ), where ∗w is a free wreath product. Then we discuss representation theory of free wreath products, with the conjectural formula μ(G ∗w H) = μ(G) ⊠ μ(H), where μ is the associated spectral measure. This is verified in two situations: one using free probability techniques, t...

متن کامل

The Conjugacy Problem in Wreath Products and Free Metabelian Groups

1. Introduction. The conjugacy problem was formulated by Dehn in 1912 for finitely presented groups [1]. The question was whether it can be effectively determined for such a group when two elements are conjugate. This general question was answered in the negative by Novikov in 1954 [6J. But it is still of interest to determine whether the problem is solvable for particular finitely presented gr...

متن کامل

The conjugacy problem in free solvable groups and wreath product of abelian groups is in TC$^0$

We show that the conjugacy problem in a wreath product A ≀B is uniformTC -Turing-reducible to the conjugacy problem in the factors A and B and the power problem in B. Moreover, if B is torsion free, the power problem for B can be replaced by the slightly weaker cyclic submonoid membership problem for B, which itself turns out to be uniform-TC-Turing-reducible to conjugacy problem in A ≀B if A i...

متن کامل

Statistical properties of braid groups in locally free approximation

Statistical and probabilistic characteristics of locally free group with growing number of generators are defined and their application to statistics of braid groups is given.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Functional Analysis

سال: 2016

ISSN: 0022-1236

DOI: 10.1016/j.jfa.2015.12.017